#include <bits/stdc++.h>
using namespace std;

int match[2] = {11, 21};
int s[25 * 2500 + 10] = {0}; 
int main() {
	char ch;
	int me = 0;
	int op = 0;
	long long cnt = 0;
	while (cin >> ch) {
		if (ch == 'W') {
			s[cnt] = 1;
		} else if (ch == 'L') {
			s[cnt] = 0;
		} else if (ch == 'E') {
			break;
		}
		cnt ++;
  	}
  	for (int k = 0; k<2; k++) {
  		int w = 0, l = 0;
  		for (long long i=0; i<cnt; i++) {
  			w += s[i];
  			l += 1 - s[i];
  			if (max(w, l) >= match[k] && abs(w - l) >= 2) {
  				cout << w << ":" << l << endl;	
  				w = 0, l = 0;
			}
		}
		cout << w << ":" << l << endl;
		cout << endl;
	}
	return 0;
} 
